(0,1)-Matrices with No Half–Half Submatrix of Ones
نویسندگان
چکیده
منابع مشابه
(0, 1)-Matrices with No Half-Half Submatrix of Ones
We consider the minimum number of zeroes in a 2m 2n (0; 1)-matrix M that contains no m n submatrix of ones. We show that this number, denoted by f(m; n), is at least 2n + m + 1 for m n. We determine exactly when this bound is sharp and determine the extremal matrices in these cases. For any m, the bound is sharp for n = m and for all but nitely many n > m. A general upper bound due to Gentry, f...
متن کاملApproximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (COS) problem is, given a 0-1 matrix A, to find the largest number of columns of A that form a submatrix with the C1P property. Such a problem has potential applications in physical mapping with hybridization data. This paper p...
متن کاملThe Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint
By using Moore-Penrose generalized inverse and the general singular value decomposition of matrices, this paper establishes the necessary and sufficient conditions for the existence of and the expressions for the centrosymmetric solutions with a submatrix constraint of matrix inverse problem AX = B. In addition, in the solution set of corresponding problem, the expression of the optimal approxi...
متن کاملApproximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a proble...
متن کاملImproved Submatrix Maximum Queries in Monge Matrices
We present efficient data structures for submatrix maximum queries in Monge matrices and Monge partial matrices. For n× n Monge matrices, we give a data structure that requires O(n) space and answers submatrix maximum queries in O(logn) time. The best previous data structure [Kaplan et al., SODA‘12] required O(n logn) space and O(log n) query time. We also give an alternative data structure wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1997
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0133